Intrinsic Graph Distances Compared to Euclidean Distances for Correspondent Graph Embedding
نویسندگان
چکیده
Chemical structures of organic compounds are characterized numerically by a variety of structural descriptors computed either from the molecular graph or from the three-dimensional (3D) molecular geometry. Extensive use of such structural descriptors or topological indices has been made in drug design, screening of chemical databases, similarity and diversity assessment, and quantitative structure-activity relationships. In recent years a large variety of topological indices were derived from different sorts of graph distance functions which have been considered to characterize the molecular shape and structure. These include not only the shortest-path distance but also the resistance distance and the quasi-Euclidean distance. A comparison is made between five intrinsic graph distance functions and the geometric distance for a set of benzenoid hydrocarbons. Overall, a very good correlation is obtained for all graph distances, indicating that the graph descriptors derived from them capture some part of the 3D information of the molecular structure. INTRODUCTION Professor Alexandru T. Balaban (Sandy) is one of the early developers and proponents of the field of topological indices (TIs) which are chemical descriptors derived from the # Dedicated on the occasion of the 70 birthday to Professor Alexandru T. Balaban, who has long pursued the use of topological indices as QSAR and QSPR descriptors
منابع مشابه
Zero-Shot Learning on Semantic Class Prototype Graph.
Zero-Shot Learning (ZSL) for visual recognition is typically achieved by exploiting a semantic embedding space. In such a space, both seen and unseen class labels as well as image features can be embedded so that the similarity among them can be measured directly. In this work, we consider that the key to effective ZSL is to compute an optimal distance metric in the semantic embedding space. Ex...
متن کاملInterior Distance Using Barycentric Coordinates
This paper introduces a framework for defining a shape-aware distance measure between any two points in the interior of a surface mesh. Our framework is based on embedding the surface mesh into a high-dimensional space in a way that best preserves boundary distances between vertices of the mesh, performing a mapping of the mesh volume into this high-dimensional space using barycentric coordinat...
متن کاملApproximate Conditional Distributions of Distances between Nodes in a Two-Dimensional Sensor Network
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph, defined to be the number of edges on a shortest path between them. In this paper, we consider a network of sensors placed uniformly at random in a two-dimensi...
متن کاملHyperspherical embedding of graphs and networks in communicability spaces
Let G be a simple connected graph with n nodes and let fαk (A) be a communicability function of the adjacency matrix A, which is expressible by the following Taylor series expansion: ∞ k=0 αkA k. We prove here that if fαk (A) is positive semidefinite then the function ηp,q = (fαk (A)pp+ fαk (A)qq−2fαk (A)pq) 1 2 is a Euclidean distance between the corresponding nodes of the graph. Then, we pr...
متن کاملConvex Optimization of Low Dimensional Euclidean Distances Convex Optimization Learning of Faithful Euclidean Distance Representations in Nonlinear Dimensionality Reduction
Classical multidimensional scaling only works well when the noisy distances observed in a high dimensional space can be faithfully represented by Euclidean distances in a low dimensional space. Advanced models such as Maximum Variance Unfolding (MVU) and Minimum Volume Embedding (MVE) use Semi-Definite Programming (SDP) to reconstruct such faithful representations. While those SDP models are ca...
متن کامل